منابع مشابه
Entropy of Bounding Tori
Branched manifolds that describe strange attractors in R can be enclosed in, and are organized by, canonical bounding tori. Tori of genus g are labeled by a symbol sequence, or “periodic orbit”, of period g−1. We show that the number of distinct canonical bounding tori grows exponentially like N(g) ∼ eλ(g−1), with e = 3, so that the “bounding tori entropy” is log(3).
متن کاملStrange attractors are classified by bounding Tori.
There is at present a doubly discrete classification for strange attractors of low dimension, d(L)<3. A branched manifold describes the stretching and squeezing processes that generate the strange attractor, and a basis set of orbits describes the complete set of unstable periodic orbits in the attractor. To this we add a third discrete classification level. Strange attractors are organized by ...
متن کاملAgglomerative Grouping of Observations by Bounding Entropy Variation
An information theoretic framework for grouping observations is proposed. The entropy change incurred by new observations is analyzed using the Kalman filter update equations. It is found, that the entropy variation is caused by a positive similarity term and a negative proximity term. Bounding the similarity term in the spirit of the minimum description length principle and the proximity term ...
متن کاملBounding Relative Entropy by the Relative Entropy of Local Specifications in Product Spaces
The above inequality implies a logarithmic Sobolev inequality for q. We get an explicit lower bound for the logarithmic Sobolev constant of q under the assumptions that: (i) the local specifications of q satisfy logarithmic Sobolev inequalities with constants ρi, and (ii) they also satisfy some condition expressing that the mixed partial derivatives of the Hamiltonian of q are not too large rel...
متن کاملBounding Extremal Degrees of Edge-Independent Random Graphs Using Relative Entropy
Edge-independent random graphs are a model of random graphs in which each potential edge appears independently with an individual probability. Based on the relative entropy method, we determine the upper and lower bounds for the extremal vertex degrees using the edge probability matrix and its largest eigenvalue. Moreover, an application to random graphs with given expected degree sequences is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2010
ISSN: 1099-4300
DOI: 10.3390/e12040953